A redefinition of Embedded Push-Down Automata
نویسندگان
چکیده
A new definition of Embedded Push-Down Automata is provided. We prove this new definition preserves the equivalence with tree adjoining languages and we provide a tabulation framework to execute any automaton in polynomial time with respect to the length of the input string.
منابع مشابه
A Formal Deenition of Bottom-up Embedded Push-down Automata and Their Tabulation Technique
The task of designing parsing algorithms for tree adjoining grammars could be simpliied by providing a separation between the description of the parsing strategy and the execution of the parser. This can be accomplished through the use of Bottom-up Embedded Push-Down Automata. Towards this aim, we provide a formal and consistent deeni-tion of this class of automata and, by removing the nite-sta...
متن کاملA Formal Definition of Bottom-Up Embedded Push-Down Automata and Their Tabulation Technique
The task of designing parsing algorithms for tree adjoining grammars could be simplified by providing a separation between the description of the parsing strategy and the execution of the parser. This can be accomplished through the use of Bottom-up Embedded Push-Down Automata. Towards this aim, we provide a formal and consistent definition of this class of automata and, by removing the finite-...
متن کاملCharacterizing Unambiguous Augmented Pushdown Automata by Circuits 3
The notions of weak and strong unambiguity of augmented push-down automata are considered and related to unambiguities of circuits. In particular we exhibit circuit classes exactly characterizing polynomially time bounded unambiguous augmented push-down automata.
متن کاملOn the Power of Automata Based Proof Systems
One way to address the NP = co − NP question is to consider the length of proofs of tautologies in various proof systems. In this work we consider proof systems defined by appropriate classes of automata. In general, starting from a given class of automata we can define a corresponding proof system in a natural way. An interesting new proof system that we consider is based on the class of push ...
متن کاملMulti-Push-Down Languages and Grammars
A new class of languages, called multi-push-down (mpd), that generalize the classical context-free (cf, or Chomsky type 2) ones is introduced. These languages preserve some important properties of cf languages: a generalization of the Chomsky-Schh utzenberger homomorphic characterization theorem, the Parikh theorem and a \pumping lemma" are proved. Multi-push-down languages are an AFL. Their re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000